翻訳と辞書 |
Alternation (formal language theory) : ウィキペディア英語版 | Alternation (formal language theory) In formal language theory and pattern matching, alternation is the union of two sets of strings or patterns. As a pattern, the alternation of ''a'' and ''b'' matches either ''a'' or ''b''. In formal language theory, alternation is commutative and associative. This is not in general true in pattern-matching languages. In the SNOBOL language, regular expression syntax, and some other languages, alternation is a binary infix operator on patterns, notated "|". ==References==
* John E. Hopcroft and Jeffrey D. Ullman, ''Introduction to Automata Theory, Languages and Computation'', Addison-Wesley Publishing, Reading Massachusetts, 1979. ISBN 0-201-02988-X.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Alternation (formal language theory)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|